A Simple Algorithm for Solving for the Generalized Longest Common Subsequence (LCS) Problem with a Substring Exclusion Constraint
نویسندگان
چکیده
منابع مشابه
A Simple Algorithm for Solving for the Generalized Longest Common Subsequence (LCS) Problem with a Substring Exclusion Constraint
This paper studies the string-excluding (STR-EC)-constrained longest common subsequence (LCS) problem, a generalized LCS problem. For the two input sequences, X and Y , of lengths n andm and a constraint string, P , of length r, the goal is to find the longest common subsequence, Z, of X and Y that excludes P as a substring. The problem and its solution were first proposed by Chen and Chao, but...
متن کاملthe algorithm for solving the inverse numerical range problem
برد عددی ماتریس مربعی a را با w(a) نشان داده و به این صورت تعریف می کنیم w(a)={x8ax:x ?s1} ، که در آن s1 گوی واحد است. در سال 2009، راسل کاردن مساله برد عددی معکوس را به این صورت مطرح کرده است : برای نقطه z?w(a)، بردار x?s1 را به گونه ای می یابیم که z=x*ax، در این پایان نامه ، الگوریتمی برای حل مساله برد عددی معکوس ارانه می دهیم.
15 صفحه اولA Simple Polynomial Time Algorithm for the Generalized LCS Problem with Multiple Substring Exclusive Constraints
In this paper, we present a simple polynomial time algorithm for a generalized longest common subsequence problem with multiple substring exclusion constraints. Given two sequences X and Y of lengths m and n, respectively, and a set of constraint strings P of total length r, we are to find a common subsequence z of X and Y which excludes each of strings in P as a substring and the length of z i...
متن کاملAn Efficient Dynamic Programming Algorithm for the Generalized LCS Problem with Multiple Substring Exclusion Constrains
In this paper, we consider a generalized longest common subsequence problem with multiple substring exclusion constrains. For the two input sequences X and Y of lengths n and m, and a set of d constrains P = {P1, · · · , Pd} of total length r, the problem is to find a common subsequence Z of X and Y excluding each of constrain string in P as a substring and the length of Z is maximized. The pro...
متن کاملSolving the Longest Common Subsequence (LCS) Problem using the Associative ASC Processor with Reconfigurable 2D Mesh
Solving the Longest Common Subsequence (LCS) Problem using the Associative ASC Processor with Reconfigurable 2D Mesh Virdi Sabegh Singh, Hong Wang, Robert A. Walker Computer Science Department, Kent State University, Kent OH 44242 USA Abstract As new genes are sequenced, it is necessary for molecular biologists to compare the new gene’s biosequence to known sequences. One simple form of DNA seq...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Algorithms
سال: 2013
ISSN: 1999-4893
DOI: 10.3390/a6030485